Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times
نویسندگان
چکیده
منابع مشابه
The Maximum Queue Length for Heavy-Tailed Service Times in the M/G/1 FB Queue
This paper treats the maximum queue length M , in terms of the number of customers present, in a busy cycle in the M/G/1 queue. The distribution of M depends both on the service time distribution and on the service discipline. Assume that the service times have a logconvex density and the discipline is Foreground Background (FB). The FB service discipline gives service to the customer(s) that h...
متن کاملSojourn time tails in the single server queue with heavy-tailed service times
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 − α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service discipline...
متن کامل. PR ] 5 A ug 2 00 3 The maximum queue length for heavy tailed service times
In this article we study the maximum queue length M in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy tailed) service time distributions the Foreground Background service discipline is optimal. This discipline gives service to those customer(s) that have received the least amount of service so far. It will be shown that under this discip...
متن کاملHeavy-traffic asymptotics for the single-server queue with random order of service
We consider the waiting time distribution of the Gl/Gl /1 queue where customers are served in random order; inter-arrival and service times may have finite or infinite variance. Our main result shows that the waiting time in heavy traffic can be written as a product of two random variables. Our proof is based on the intuitively appealing fact that in heavy traffic, the queue length stays consta...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2019
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-019-09640-z